the help of which the prior transactions to be validated are selected for new,

unconfirmed transactions. Transactions (previous two) with a similar Trust

Score threshold or points that have no inbound transactions in the DAG

should be validated by each new transaction. It becomes a source itself after

those sources are validated. An algorithm enables a new transaction to be

verified by two previous transactions before it is added to a node. As all

nodes contain a series of transactions and are acyclic in nature, any given

transaction cannot be encountered a second time on another node.

This eliminates the problem of double-spending while foregoing the need

for miners and stakes. As all transactions are immutable, all nodes flow in a

specific direction and cannot be traversed on an opposite traj ectory,

meaning A →

B is not B ←

A. Because miners are eliminated in a DAG,

the processing time and the fees are cut drastically. The vertices represent

transactions, and directed edges extend from each transaction to two others

that it validates in the ledger which is organized as a DAG. To reach

transaction consensus, we need to find the heaviest cumulative chain. If the

cumulative chain has surpassed a predetermined threshold, the transaction

will reach a “trusted” consensus and can be confirmed. The chain can reach

the required cumulative trust score threshold faster is incentivized with

optimized transaction confirmations with those having higher Trust Scores.

A transaction confirmation rate of 10,000 TPS is enabled by the implicit

nature of the DAG structure, and further, the validation process enables the

protocol to reach a faster consensus.

Security connect

The security mechanisms available are as per:

A. ISO 27 001—

ISMS—

CIA standard which ensures

1. Confidentiality—

encrypted and access control

2. Integrity—

write as append mode only and cannot change earlier

transaction and transaction accepted by multiple nodes (ideally 5 1%

)

to commit transaction

3 . Availability—

multiple copies

B. Quantum computing impact on common cryptographic algorithms

Impact from large-scale

Type

Purpose

Impact from Large-Scale